Scheduling Algorithm: Tasks Scheduling Algorithm for Multiple Processors with Dynamic Reassignment
نویسندگان
چکیده
منابع مشابه
A Service-Clustering-based Dynamic Scheduling Algorithm for Grid Tasks
Task scheduling in Grid environment is a challenging problem because of NP-complete nature of scheduling issue and dynamic characteristic of the environment. Not constrained by local scheduling policy of Grid site, a dynamic service evaluation method based on cloud model is presented. Then we obtain performance metrics of dynamic service. According to dynamic service evaluation, an adaptive and...
متن کاملA Scheduling Algorithm for Parallelizable Dependent Tasks
Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a task graph on a multiprocessor, called the parallelizable dependent task scheduling problem. Associated with each task, we are given the time it takes to run...
متن کاملAn approximation algorithm for scheduling dependent tasks on m processors with small communication delays
This paper de nes and studies an approximation algorithm for scheduling tasks with small communication delays onm processors. In a rst step, a schedule 1 for the problem instance with an unlimited number of processors is generated with a polynomial algorithm with relative performance bounded by 2(1 + ) 2 + , where denotes the ratio between the greatest communication delay and the smallest proce...
متن کاملA Novel Dynamic Task Scheduling Algorithm for Grid Networks with Recon gurable Processors
The incorporation of recon gurable processors in computational grids promises to provide increased performance without compromising exibility. Consequently, grid networks (such as TeraGrid) are utilizing recon gurable computing resources next to general-purpose processors (GPPs) in their computing nodes. The near-optimal utilization of resources in a grid network considerably depends on the app...
متن کاملOptimal Scheduling of Periodic Tasks on Multiple Identical Processors
We consider the problem of scheduling m periodic tasks on n; n < m; identical processors. Our main contribution is to show that the condition n, where is the total density of the task set, is a suucient condition for scheduling the m tasks such that no deadlines are ever missed. We start with a novel representation of the periodic task scheduling problem as a maximum network ow problem. The str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Systems, Networks, and Communications
سال: 2008
ISSN: 1687-7381,1687-739X
DOI: 10.1155/2008/578180